Hardness of approximation - PDFSEARCH.IO - Document Search Engine

Hardness of approximation
Results: 23

#	Item
11	Approximation Algorithms and Hardness of Integral Concurrent Flow Parinya Chalermsook∗ Julia Chuzhoy † Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2012-05-23 11:17:35
12	A Characterization of Strong Approximation Resistance Algorithm Hardness Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2013-11-25 13:30:57
13	Approximation Algorithms and Hardness of the k-Route Cut Problem Julia Chuzhoy∗ Yury Makarychev† Aravindan Vijayaraghavan‡ Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2011-12-15 13:21:10
14	Beaches of islands of tractability: Hardness results, exact algorithms and approximation algorithms for parsimony and minimum perfect phylogeny haplotyping problems Leo van Iersel1, Judith Keijsper1, Steven Kelk2, Leen S Add to Reading List Source URL: skelk.sdf-eu.org Language: English - Date: 2011-03-15 15:13:11
15	Hardness of approximation of the Balanced Complete Bipartite Subgraph problem Uriel Feige Shimon Kogan Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-01-04 08:01:54
16	Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations Dima Blokh1 Danny Segev2 Roded Sharan1 1. School of Computer Science, Tel Aviv University, 2. Department of Statistics, University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:22:26 Network theory Graph connectivity Shortest path problem Path Graph theory Mathematics Theoretical computer science
17	How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡ Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 1998-12-21 18:16:27 Complexity classes Mathematical optimization NP-complete problems Combinatorial optimization Approximation algorithm NP-complete Hardness of approximation Optimization problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
18	Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-04-25 00:45:46 NP-complete problems Operations research Combinatorial optimization Travelling salesman problem Cubic graph Hamiltonian path Gadget Degree Regular graph Graph theory Theoretical computer science Mathematics
19	The Tale of the PCP Theorem How the search for the limits of computing led to the discovery of the unexpected power of proofs Dana Moshkovitz, MIT Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-04-12 18:03:28 Probabilistic complexity theory Complexity classes Mathematical optimization Probabilistically checkable proof PCP theorem NP NEXPTIME Hardness of approximation P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
20	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 NP-complete problems Probabilistic complexity theory Mathematical optimization Complexity classes PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics